Upper Bounds on Inefficiency of Taxed Stackelberg Network with Cross- Nested Logit Assignment
نویسندگان
چکیده
منابع مشابه
Upper Bounds on Inefficiency of Taxed Stackelberg Network with Cross- Nested Logit Assignment
Upper bound of efficiency loss is a valuable issue for transport network design and planning. This paper initially explores it in a taxed stochastic traffic network whose equilibrium flow pattern is deduced by a cross-nested Logit (CNL) flow assignment model, and a centrally controlling Stackelberg strategy. With the assumptions of separability, nondecreasingness, and convexity of the link time...
متن کاملA Path-Based Algorithm for the Cross-Nested Logit Stochastic User Equilibrium Traffic Assignment
This paper investigates the single-class static stochastic user equilibrium (SUE) problem with separable and additive link costs. A SUE assignment based on the Cross-Nested Logit (CNL) route choice model is presented. The CNL model can better represent route choice behavior compared to the Multinomial Logit (MNL) model, while keeping a closed form equation. The paper uses a specific optimizatio...
متن کاملA theoretical analysis of the cross-nested logit model
The emergence of Intelligent Transportation Systems and the associated technologies has increased the need for complex models and algorithms. Namely, real-time information systems, directly influencing transportation demand, must be supported by detailed behavioral models capturing travel and driving decisions. Discrete choice models methodology provide an appropriate framework to capture such ...
متن کاملProbit and nested logit models based on fuzzy measure
Inspired by the interactive discrete choice logit models [Aggarwal, 2019], this paper presents the advanced families of discrete choice models, such as nested logit, mixed logit, and probit models to consider the interaction among the attributes. Besides the DM's attitudinal character is also taken into consideration in the computation of choice probabilities. The proposed choice models make us...
متن کاملApproximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds
the expected revenue we obtain given that nest i is selected is Ri(wi) = P j∈N wij (κij−ηij logwij) P j∈N wij , where M = {1, . . . ,m}, N = {1, . . . , n} and γi ∈ [0, 1] measures product dissimilarity within nests. Due to a one-to-one relationship, control of the preference weights equates to control of the prices κij−ηij logwij , where 1/ηij represents product price sensitivity and κij/ηij r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Cybernetics & Systemics Journal
سال: 2014
ISSN: 1874-110X
DOI: 10.2174/1874110x014080101091